Partial Smoothness and Constant Rank
نویسندگان
چکیده
In optimization, the notion of a partly smooth objective function is powerful for applications in algorithmic convergence and postoptimality analysis, yet complex to define. A shift focus first-order optimality conditions reduces concept simple constant-rank condition. this view, partial smoothness extends more general variational systems, encompassing particular saddlepoint operators underlying popular primal-dual splitting algorithms. For broad class semi-algebraic generalized equations, holds generically.
منابع مشابه
Partial Smoothness, Tilt Stability, and Generalized Hessians
We compare two recent variational-analytic approaches to second-order conditions and sensitivity analysis for nonsmooth optimization. We describe a broad setting where computing the generalized Hessian of Mordukhovich is easy. In this setting, the idea of tilt stability introduced by Poliquin and Rockafellar is equivalent to a classical smooth second-order condition.
متن کاملConstant Rank-Distance Sets of Hermitian Matrices and Partial Spreads in Hermitian Polar Spaces
In this paper we investigate partial spreads of H(2n− 1, q2) through the related notion of partial spread sets of hermitian matrices, and the more general notion of constant rank-distance sets. We prove a tight upper bound on the maximum size of a linear constant rank-distance set of hermitian matrices over finite fields, and as a consequence prove the maximality of extensions of symplectic sem...
متن کاملSmooth Maps of Constant Rank
(A manifold with such a Morse function will be said to have geometric dimension ^k. We will write geo dim M^K.) Notation. M and W are smooth manifolds with tangent bundles TM, TW; Homk(M, W) is the space of smooth maps of rank k from M to W, with the C^compact-open topology; Link(TM, TW) is the space of continuous maps: TM-+TW which are fiberwise linear maps of rank k, with the compact open top...
متن کاملIdentifying Active Constraints via Partial Smoothness and Prox-Regularity
Active set algorithms, such as the projected gradient method in nonlinear optimization, are designed to “identify” the active constraints of the problem in a finite number of iterations. Using the notions of “partial smoothness” and “prox-regularity” we extend work of Burke, Moré and Wright on identifiable surfaces from the convex case to a general nonsmooth setting. We further show how this se...
متن کاملConstant rank constraint qualifications: a geometric introduction
Constraint qualifications (CQ) are assumptions on the algebraic description of the feasible set of an optimization problem that ensure that the KKT conditions hold at any local minimum. In this work we show that constraint qualifications based on the notion of constant rank can be understood as assumptions that ensure that the polar of the linear approximation of the tangent cone, generated by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Siam Journal on Optimization
سال: 2022
ISSN: ['1095-7189', '1052-6234']
DOI: https://doi.org/10.1137/19m1237909